Dense Probabilistic Encryption
نویسنده
چکیده
This paper describes a method of dense probabilistic encryption. Previous probabilistic encryption methods require large numbers of random bits and produce large amounts of ciphertext for the encryption of each bit of plaintext. This paper develops a method of probabilistic encryption in which the ratio of ciphertext text size to plaintext size and the proportion of random bits to plaintext can both be made arbitrarily close to one. The methods described here have applications which are not in any apparent way possible with previous methods. These applications include simple and e cient protocols for noninteractive veri able secret sharing and a method for conducting practical and veri able secret-ballot elections.
منابع مشابه
Benaloh's Dense Probabilistic Encryption Revisited
In 1994, Josh Benaloh proposed a probabilistic homomorphic encryption scheme, enhancing the poor expansion factor provided by Goldwasser and Micali’s scheme. Since then, numerous papers have taken advantage of Benaloh’s homomorphic encryption function, including voting schemes, private multi-party trust computation, non-interactive verifiable secret sharing, online poker. In this paper we show ...
متن کاملProbabilistic encryption goldwasser pdf
We replace deterministic block encryption by probabilistic encryption of single. This property enabled Goldwasser and Micali ill to device a scheme for Mental.A new probabilistic model of data encryption is introduced. Laboratory of.presenting the first probabilistic cryptosystem by Goldwasser and Micali.
متن کاملTrapdooring Discrete Logarithms on Elliptic Curves over Rings
This paper introduces three new probabilistic encryption schemes using elliptic curves over rings. The cryptosystems are based on three specific trapdoor mechanisms allowing the recipient to recover discrete logarithms on different types of curves. The first scheme is an embodiment of Naccache and Stern’s cryptosystem and realizes a discrete log encryption as originally wanted in [23] by Vansto...
متن کاملLecture Notes on Part Ii of Introduction to Cryptography
1.1. Why do we need probabilistic encryption? The point of probabilistic encryption is to eliminate any information leaked with public-key cryptography. Assuming a cryptanalyst has a ciphertext C = Ek(M) of message M encrypted with public key Ek and he wants to recover message M. If he guesses correctly a random message M' such that C 0 = Ek(M ) and C'=C, then he knows that M'=M. If it's wrong,...
متن کاملPerformance Analysis of Goldwasser-Micali Cryptosystem
Probabilistic encryption is the use of randomness in an encryption algorithm, so that when encrypting the same message several times it will, in general, yield different ciphertexts. To be semantically secure, that is, to hide even partial information about the plaintext, an encryption algorithm must be probabilistic. The Goldwasser–Micali cryptosystem is an asymmetric key encryption algorithm ...
متن کامل